Large Hierarchies from ApproximateRSymmetries
نویسندگان
چکیده
منابع مشابه
Large hierarchies from approximate R symmetries.
We show that hierarchically small vacuum expectation values of the superpotential in supersymmetric theories can be a consequence of an approximate R symmetry. We briefly discuss the role of such small constants in moduli stabilization and understanding the huge hierarchy between the Planck and electroweak scales.
متن کاملExtracting Semantic Hierarchies from a Large On-Line Dictionary
Dictionaries are rich sources of detailed semantic information, but in order to use the information for natural language processing, it must be organized systematically. This paper describes automatic and semi-automatic procedures for extracting and organizing semantic fea= ture information implicit in dictionary definitions. Two head-finding heuristics are described for locating the genus term...
متن کاملCreating Topic Hierarchies for Large Medical Libraries
Web-based medical digital libraries contain a huge amount of valuable, up-to-date health care information. However, their size, their keywordbased access methods and their lack of semantic structure make it difficult to find the desired information. In this paper we present an automatic, unsupervised and domain-independent approach for structuring the resources available in an electronic reposi...
متن کاملStructure-Based Partitioning of Large Concept Hierarchies
The increasing awareness of the benefits of ontologies for information processing has lead to the creation of a number of large ontologies about real world domains. The size of these ontologies and their monolithic character cause serious problems in handling them. In other areas, e.g. software engineering, these problems are tackled by partitioning monolithic entities into sets of meaningful a...
متن کاملLarge-Scale Sorting in Uniform Memory Hierarchies
We present several e cient algorithms for sorting on the uniform memory hierarchy (UMH), introduced by Alpern, Carter, and Feig, and its parallelization P-UMH. We give optimal and nearly-optimal algorithms for a wide range of bandwidth degradations, including a parsimonious algorithm for constant bandwidth. We also develop optimal sorting algorithms for all bandwidths for other versions of UMH ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review Letters
سال: 2009
ISSN: 0031-9007,1079-7114
DOI: 10.1103/physrevlett.102.121602